Computing finitely reachable containable region for switching systems
نویسنده
چکیده
In this paper the practical stability issue of a switching system is discussed in terms of solving a containability problem and an attraction problem. A novel computational procedure based on nonlinear programming is presented to compute a containable region, in which each trajectory from inside cannot move out under a given single-step-lookahead control policy. How to decide whether the obtained containable region is finitely reachable from a point outside the region is then examined. The proposed approach is demonstrated on a two-tank system.
منابع مشابه
A Reachability based Stability Analysis for Switching Systems
In this paper we discuss the practical stability issue of a switching system in terms of solving a containability problem and an attraction problem. A novel computational procedure based on nonlinear programming is presented to compute a containable region, in which each trajectory from inside cannot move out under a given single-step-lookahead control policy. Then we discuss how to decide whet...
متن کاملComputing reachable sets for uncertain nonlinear monotone systems
We address nonlinear reachability computation for uncertain monotone systems, those for which flows preserve a suitable partial orderings on initial conditions. In a previous work [1], we introduced a nonlinear hybridization approach to nonlinear continuous reachability computation. By analysing the signs of off-diagonal elements of system’s Jacobian matrix, a hybrid automaton can be obtained, ...
متن کاملThe reachable set of a linear endogenous switching system
In this work, switching systems are named endogenous when their switching pattern is controllable. Linear endogenous switching systems can be considered as a particular class of bilinear control systems. The key idea is that both types of systems are equivalent to polysystems i.e. to systems whose flow is piecewise smooth. The reachable set of a linear endogenous switching system can be studied...
متن کاملValidating a Hamilton-Jacobi Approximation to Hybrid System Reachable Sets
We develop a general framework for solving the hybrid system reachability problem, and indicate how several published techniques fit into this framework. The key unresolved need of any hybrid system reachability algorithm is the computation of continuous reachable sets; consequently, we present new results on techniques for calculating numerical approximations of such sets evolving under genera...
متن کاملDesigning a hybrid quantum controller for strongly eigenstate controllable systems
In this paper, a new quantum hybrid controller for controlling the strongly eigenstate controllable systems, is designed. For this purpose, a Lyapunov control law is implemented when the target state is in reachable set of the initial state. On the other hand, if the target state is not in the reachable set of the given initial state, based on Grover algorithm, a new interface state that the t...
متن کامل